Problem finding - PDFSEARCH.IO - Document Search Engine

Problem finding
Results: 175

#	Item
51	Finding Shortest Non-Trivial Cycles ∗ in Directed Graphs on Surfaces Sergio Cabello Éric Colin de Verdière Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2010-04-01 04:31:48 Network theory Graph connectivity Shortest path problem Graph Degree Matching Maximum flow problem Connected component Tree Graph theory Mathematics Theoretical computer science
52	BEYOND DATA REGULATION: FINDING SOLUTION TO A PERSISTENT PROBLEM OF MARINE DEBRIS AND SEA SURFACE TEMPERATURE MEASUREMENT ALONG COASTLINE OF LAGOS, NIGERIA O A Ediang1* and A A Ediang2 1 Add to Reading List Source URL: isds.nict.go.jp Language: English* - Date: 2013-06-14 03:58:16 Water Physical oceanography Atlantic Ocean Government of Nigeria Transport in Nigeria Sea surface temperature Lagos Nigeria Marine debris Earth Physical geography Aquatic ecology
53	PrimeGridʼs The Riesel Problem On 2 Feb 2012, 21:30:55 UTC, PrimeGrid’s The Riesel Problem project eliminated k=by finding the prime: 162941The prime is 299,145 digits long and will enter Chris Caldw Add to Reading List Source URL: www.primegrid.com Language: English* - Date: 2012-02-03 00:05:08 Numbers Riesel Sieve PrimeGrid Riesel number LLR Primality test Twin Prime Search Lucas–Lehmer–Riesel test Prime numbers Mathematics Number theory
54	Facts and Oddities Online James L. Horton The great challenge of the Internet is size. Nearly everything one wants to find is there, but the problem is finding it. Add to Reading List Source URL: www.online-pr.com Language: English - Date: 2003-04-09 04:46:06 Technology Internet New media Scientific revolution Virtual reality Google Public relations Computing Human–computer interaction Digital media World Wide Web
55	A Constraint Solver for Software Engineering: Finding Models and Cores of Large Relational Specifications by Emina Torlak Add to Reading List Source URL: homes.cs.washington.edu Language: English - Date: 2014-08-13 19:26:58 NP-complete problems Constraint programming Logic in computer science Propositional calculus Unsatisfiable core Electronic design automation Boolean satisfiability problem Symmetry Satisfiability Theoretical computer science Mathematics Applied mathematics
56	CCCG 2011, Toronto ON, August 10–12, 2011 Finding Optimal Geodesic Bridges Between Two Simple Polygons Amit M. Bhosle∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 Computational geometry Discrete geometry Euclidean plane geometry Simple polygon Geodesic Vertex Distance Voronoi diagram Art gallery problem Geometry Mathematics Polygons
57	PrimeGridʼs The Riesel Problem On 5 Apr:13:12 UTC, PrimeGrid’s The Riesel Problem project eliminated k=65531 by finding the Mega Prime: 65531The prime is 1,092,546 digits long and will enter Chris C Add to Reading List Source URL: www.primegrid.com Language: English* - Date: 2011-04-12 01:04:58 Numbers Riesel Sieve PrimeGrid Riesel number LLR Megaprime Primality test Twin Prime Search Lucas–Lehmer–Riesel test Prime numbers Mathematics Number theory
58	CCCG 2011, Toronto ON, August 10–12, 2011 Finding Optimal Geodesic Bridges Between Two Simple Polygons Amit M. Bhosle∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 Computational geometry Discrete geometry Euclidean plane geometry Simple polygon Geodesic Vertex Distance Voronoi diagram Art gallery problem Geometry Mathematics Polygons
59	PrimeGrid’s The Riesel Problem On 21 Nov 2010, 11:14:00 UTC, PrimeGrid’s The Riesel Problem project eliminated k=by finding the Mega prime: 1912492^The prime is 1,028,835 digits long and enters Chri Add to Reading List Source URL: www.primegrid.com Language: English* - Date: 2010-12-02 23:45:58 Numbers Riesel Sieve PrimeGrid Riesel number LLR Megaprime Primality test Lucas–Lehmer–Riesel test Twin Prime Search Prime numbers Mathematics Number theory
60	PSEUDOCODE FOR FINDING THE SHORTEST MULTIPLIERS FOR THE EXTENDED GCD PROBLEM KEITH MATTHEWS Input: m positive integers d1 , . . . , dm . Output: gcd(d1 , . . . , dm ) and all multiplier vectors (y1 , . . . , ym ) ∈ Zm Add to Reading List Source URL: www.numbertheory.org Language: English - Date: 2011-11-01 22:30:18 Fourier analysis Multiplier

UPDATE